Model Checking Abilities under Incomplete Information Is Indeed Delta2-complete
نویسندگان
چکیده
We study the model checking complexity of Alternating-time temporal logic with imperfect information and imperfect recall (atlir). Contrary to what we have stated in [11], the problem turns out to be∆2 -complete, thus con rming the initial intuition of Schobbens [18]. We prove ∆2 -hardness through a reduction of the SNSAT problem, while the membership in∆ P 2 stems from the algorithm presented in [18].
منابع مشابه
Model Checking Abilities under Incomplete Information Is Indeed ∆ P 2 - complete Wojciech Jamroga and Jürgen Dix
We study the model checking complexity of Alternating-time temporal logic with imperfect information and imperfect recall (ATLir). Contrary to what we have stated in [10], the problem turns out to be ∆2 -complete, thus confirming the initial intuition of Schobbens. We prove the∆2 -hardness through a reduction of the SNSAT problem, while the membership in ∆2 stems from the algorithm presented in...
متن کاملAlternating-time temporal logic with finite-memory strategies
Model-checking the alternating-time temporal logics AT L and AT L∗ with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed is bounded and one where the memory ...
متن کاملStates vs. Traces in Model Checking by Abstract Interpretation
In POPL’00, Cousot and Cousot showed that the classical state-based model checking of a very general temporal language called x? μ -calculus is an incomplete abstract interpretation of its trace-based semantics. In ESOP’01, Ranzato showed that the least refinement of the state-based model checking semantics of the x? μ -calculus which is complete w.r.t. its trace-based semantics exists, and it ...
متن کاملOn the Computational Aspect of Rule Based Database Updates
We develop a general framework of rule based database update on the basis of prioritized logic programs. This approach has advantages in representing and handling information connict in updates. We then focus on the computational aspect of this approach. We show that under our framework, the model checking in an update is co-NP-complete, while the associated inference problem is P 2-complete. F...
متن کاملFixpoint Approximation of Strategic Abilities under Imperfect Information
We propose a new approach to model checking the strategic logic ATLir.
متن کامل